Field reduction in finite projective geometry Geertrui Van de Voorde Ghent University & Free University Brussels (VUB) Fq 11 July 22–, Magdeburg

Source URL: www.math.uni-magdeburg.de

• Projective geometry
• Projective plane
• Projective space
• Blocking set
• Projective
• Fano plane
• Arc
• Duality
• Collineation
• Homography

I MPROVED L EARNING C OMPLEXITY IN C OMBINATORIAL P URE E XPLORATION B ANDITS V ICTOR G ABILLON , A LESSANDRO L AZARIC , M OHAMMAD G HAVAMZADEH , R ONALD O RTNER & P ETER B ARTLETT 1) A BSTRACT

Source URL: victorgabillon.nfshost.com

• Functional analysis
• FO
• Finite model theory
• Distribution
• Portable character set

Scenery Reconstruction on Finite Abelian Groups Hilary Finucanea,1 , Omer Tamuza,2 , Yariv Yaaria a Weizmann Institute, Rehovot 76100, Israel

Source URL: people.hss.caltech.edu

• Random walk
• Fourier transform
• Limit set
• Stallings theorem about ends of groups

Reconstructing Curves from Points and Tangents L. Greengard and C. Stucchio March 10, 2009 Abstract Reconstructing a finite set of curves from an unordered set of sample points is a well studied topic. There has been les

Source URL: www.chrisstucchio.com

Parametric vs Nonparametric Models • Parametric models assume some finite set of parameters ✓. Given the parameters, future predictions, x, are independent of the observed data, D: P (x|✓, D) = P (x|✓) therefore

Source URL: mlss.tuebingen.mpg.de

UNEXPECTED APPLICATIONS OF POLYNOMIALS IN COMBINATORICS LARRY GUTH In the last six years, several combinatorics problems have been solved in an unexpected way using high degree polynomials. The most well-known of these p

Source URL: math.mit.edu

• Mathematics
• Algebra
• Mathematical analysis
• Polynomials
• Computer algebra
• Kakeya set
• Algebraic geometry
• Algebraic curve
• Finite field
• Permutation polynomial
• Resultant

ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n|S|1/n . In fact, we can sa

Source URL: math.mit.edu

• Mathematics
• Mathematical analysis
• Algebra
• Polynomials
• Transcendental numbers
• Diophantine approximation
• Coding theory
• Algebraic function
• Elliptic curve

A LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES ´ Y. O. HAMIDOUNE AND J. RUE Abstract. Let A be a finite nonempty set of integers. An asymptotic estimate

Source URL: www-ma2.upc.edu

How few directions can a function over a finite field f determine ? How small can the set D(f ) be ? D(f ) = { f (y ) − f (x) | x, y ∈ Fq , x 6= y }

Source URL: www-ma4.upc.es